#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
LL tot=0;
bool cmp(LL A,LL B){
     return A>B;
}
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n;cin>>n;
        for(LL i=1;i<=n;i++) cin>>a[i];

        tot=0;
        for(LL i=1;i<=n;i++){
            if(a[i]%2==0){
                b[++tot]=a[i];
            }
        }
        for(LL i=1;i<=n;i++){
            if(a[i]&1){
                b[++tot]=a[i];
            }
        }
        LL ans=0;
        for(LL i=1;i<=tot;i++){
            for(LL j=i+1;j<=tot;j++){
                if(__gcd(b[i],2*b[j])>1){
                    ans++;
                }
            }
        }
        cout<<ans<<"\n";
    }
   	return 0;
}
